BFHSP: A Breadth-First Heuristic Search Planner
نویسندگان
چکیده
Our Breadth-First Heuristic Search Planner (BFHSP) is a domain-independent STRIPS planner that finds sequential plans that are optimal with respect to the number of actions it takes to reach a goal. We developed BFHSP as part of our research on space-efficient graph search. It uses breadth-first search since we found that breadth-first search is more efficient than best-first search when divide-andconquer solution reconstruction is used to reduce memory requirements. The specific search algorithm used by BFHSP is Breadth-First Iterative-Deepening A* (Zhou & Hansen 2004) with some enhancements. Like HSP2.0 (Bonet & Geffner 2001a), BFHSP can search in either progression or regression space. The admissible heuristic function used is the hmax heuristic (Bonet & Geffner 2001b) in progression search, and the max-pair heuristic (Haslum & Geffner 2000) in regression search.
منابع مشابه
A New Local-Search Algorithm for Forward-Chaining Planning
Forward-chaining heuristic search is a well-established and popular paradigm for domain-independent planning. Its effectiveness relies on the heuristic information provided by a state evaluator, and the search algorithm used with this in order to solve the problem. This paper presents a new stochastic local-search algorithm for forward-chaining planning. The algorithm is used as the basis of a ...
متن کاملHeuristic Search + Symbolic Model Checking = Efficient Conformant Planning
Planning in nondeterministic domains has gained more and more importance. Conformant planning is the problem of finding a sequential plan that guarantees the achievement of a goal regardless of the initial uncertainty and of nondeterministic action effects. In this paper, we present a new and efficient approach to conformant planning. The search paradigm, called heuristic-symbolic search, relie...
متن کاملEfficient Conformant Planning
Planning in nondeterministic domains has gained more and more importance. Conformant planning is the problem of finding a sequential plan that guarantees the achievement of a goal regardless of the initial uncertainty and of nondeterministic action effects. In this paper, we present a new and efficient approach to conformant planning. The search paradigm, called heuristic-symbolic search, relie...
متن کاملStochastic Enforced Hill-Climbing
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called “basin flooding”). We propose and evaluate a stochastic generalization of enforced hill-climbing for online use in goal-oriented probabilistic planning problems. We assume a provided heuristic function estimating expected cost to the goal with fla...
متن کاملBreadth-First Heuristic Search
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show that memory requirements can be reduced even further by using a breadth-first instead of a best-first search strategy. We describe optimal and approximate breadth-first heuristic search algorithms that use divide-and-c...
متن کامل